Dubrovin's Conjecture for IG(2, 6)

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A bound for Feichtinger conjecture

In this paper‎, ‎using the discrete Fourier transform in the finite-dimensional Hilbert space C^n‎, ‎a class of nonRieszable equal norm tight frames is introduced ‎and‎ using this class, a bound for Fiechtinger Conjecture is presented. By the Fiechtinger Conjecture that has been proved recently, for given A,C>0 there exists a universal constant delta>0 independent of $n$ such that every C-equal...

متن کامل

Hadwiger's conjecture for K 6-free graphs

In 1943, Hadwiger made the conjecture that every loopless graph not contractible to the complete graph on t+1 vertices is t-colourable. When t ≤ 3 this is easy, and when t = 4, Wagner’s theorem of 1937 shows the conjecture to be equivalent to the four-colour conjecture (the 4CC). However, when t ≥ 5 it has remained open. Here we show that when t = 5 it is also equivalent to the 4CC. More precis...

متن کامل

The Auslander-Reiten Conjecture for Group Rings

This paper studies the vanishing of $Ext$ modules over group rings. Let $R$ be a commutative noetherian ring and $ga$ a group. We provide a criterion under which the vanishing of self extensions of a finitely generated $Rga$-module $M$ forces it to be projective. Using this result, it is shown that $Rga$ satisfies the Auslander-Reiten conjecture, whenever $R$ has finite global dimension and $ga...

متن کامل

Erratum to: On the DJL conjecture for order 6

In this note an erratum is provided to the article “On the DJL conjecture for order 6” by Naomi Shaked-Monderer, published in Operators and Matrices 11(1), 2017, 71–88. We will demonstrate and correct two errors in this article. The first error is in the statement of a proposition, which omits a certain category of extreme matrices. The second error is in the proof of a lemma. Fortunately the l...

متن کامل

On a Transfer Theorem for the P 6= Np Conjecture

A model of computation is defined over the algebraic numbers and over number fields. This model is non-uniform, and the cost of operations depends on the height of the operands and on the degree of the extension of the rational defined by those operands. A transfer theorem for the P 6 = NP Conjecture is proved, namely: P 6 = NP in this model over the real algebraic numbers if and only if P 6 = ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2014

ISSN: 1073-7928,1687-0247

DOI: 10.1093/imrn/rnu205